Style matching CAPTCHA: match neural transferred styles to thwart intelligent attacks
نویسندگان
چکیده
Completely automated public turing test to tell computers and humans apart (CAPTCHA) is widely used prevent malicious attacks on various online services. Text- image-CAPTCHAs have shown broader acceptability due usability security factors. However, recent progress in deep learning implies that text-CAPTCHAs can easily be exposed fraudulent attacks. Thus, are getting research attention enhance security. In this work, the neural-style transfer (NST) adapted for designing an image-CAPTCHA algorithm while maintaining human performance. NST-rendered image-CAPTCHAs, existing methods inquire a user identify or localize salient object (e.g., content) which solvable effortlessly by off-the-shelf intelligent tools. Contrarily, we propose Style Matching CAPTCHA (SMC) asks select style image applied NST method. A solve random SMC challenge understanding semantic correlation between content output as cue. The performance solving evaluated based 1368 responses collected from 152 participants through web-application. average accuracy three sessions 95.61%; response time each per 6.52 s, respectively. Likewise, Smartphone Application (SMC-App) devised using proposed SMC-App 96.33%, 5.13 s. To evaluate vulnerability of SMC, learning-based attack schemes Convolutional Neural Networks (CNN), such ResNet-50 Inception-v3 simulated. considering studies 37%, improved over methods. Moreover, in-depth analysis, experimental insights, comparative imply suitability SMC.
منابع مشابه
How to Thwart Birthday Attacks against MACs via Small Randomness
The security of randomized message authentication code, MAC for short, is typically depending on the uniqueness of random initial vectors (IVs). Thus its security bound usually contains O(q/2), when random IV is n bits and q is the number of MACed messages. In this paper, we present how to break this birthday barrier without increasing the randomness. Our proposal is almost as efficient as the ...
متن کاملCurrent Mask generation: an analogical circuit to thwart DPA attacks
This work addresses the leakage information problem concerning cryptographic circuits. Physical implementations of cryptographic algorithms may let escape some side channel information, like electromagnetic emanations, temperature, computing time, and power consumption. With these information, an attacker can retrieve the data that is being computed, like cryptographic keys. This paper proposes...
متن کاملCall Behavioral Analysis to Thwart SPIT Attacks on VoIP Networks
The threat of voice spam, commonly known as Spam over Internet Telephony (SPIT) is a real and contemporary problem. If the problem remains unchecked then it may become as potent as email spam today. In this paper, we present two approaches to detect and prevent SPITting over the Internet. Both of our approaches are based on the anomaly detection of the distributions of selected call features (i...
متن کاملSPS: A Simple Filtering Algorithm to Thwart Phishing Attacks
In this paper, we explain that by only applying a simple filtering algorithm into various proxy systems, almost all phishing attacks can be blocked without loss of convenience to the user. We propose a system based on a simple filtering algorithm which we call the Sanitizing Proxy System (SPS). The key idea of SPS is that Web phishing attack can be immunized by removing part of the content that...
متن کاملCurrent Mask Generation: an Analog Circuit to Thwart DPA Attacks
This work addresses the leakage information problem concerning cryptographic circuits. Physical implementations of cryptographic algorithms may let escape some side channel information, like electromagnetic emanations, temperature, computing time, and power consumption. With this information, an attacker can retrieve the data that is being computed, like cryptographic keys. This paper proposes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Multimedia Systems
سال: 2023
ISSN: ['1432-1882', '0942-4962']
DOI: https://doi.org/10.1007/s00530-023-01075-0